package org.example.leetCode;

/**
 * @author Administrator
 */
public class PrintNumbers {
    public int[] printNumbers(int n) {
        if (n == 0) {
            return new int[0];
        }
        int max = 0;
        for (int i = 0; i < n; i++) {
            max = max * 10 + 9;
        }
        int[] result = new int[max];
        for (int i = 0; i < max; ) {
            result[i] = ++i;
        }
        return result;
    }
}
